Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices
نویسندگان
چکیده
منابع مشابه
E-Clean Matrices and Unit-Regular Matrices
Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.
متن کاملOn the spectra of some matrices derived from two quadratic matrices
begin{abstract} The relations between the spectrum of the matrix $Q+R$ and the spectra of the matrices $(gamma + delta)Q+(alpha + beta)R-QR-RQ$, $QR-RQ$, $alpha beta R-QRQ$, $alpha RQR-(QR)^{2}$, and $beta R-QR$ have been given on condition that the matrix $Q+R$ is diagonalizable, where $Q$, $R$ are ${alpha, beta}$-quadratic matrix and ${gamma, delta}$-quadratic matrix, respectively, of ord...
متن کاملApproximating Orthogonal Matrices by Permutation Matrices
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by “non-commutative convex combinations”A of permutation matrices of the type A = P Aσσ, where σ are permutation matrices and Aσ are positive semidefinite n × n matrices summing up to the identity matrix. We prove that for every n× ...
متن کاملComplex Hadamard Matrices from Sylvester Inverse Orthogonal Matrices
A novel method to obtain parameterizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via doubling the size of inverse complex conference matrices. When the free parameters take values on the unit circle the inverse orthogonal matrices transform into...
متن کاملOrthogonal designs from negacyclic matrices
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices. We give results for all possible tuple for order 12, all but 3 for order 20 and all but 3 for order 28.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2019
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.10.001